Structural filtering: A paradigm for efficient and exact geometric programs
نویسندگان
چکیده
We introduce a new and simple filtering technique that can be used in the implementation of geometric algorithms called “structural filtering”. Using this filtering technique we gain about 20% when compared to predicatefiltered implementations. Of theoretical interest are some results regarding the robustness of sorting algorithms against erroneous comparisons. There is software support for the concept of structural filtering in LEDA (Library of Efficient Data Types and Algorithms, http://www.mpi-sb.mpg.de/LEDA/leda.html) and CGAL (Computational Geometry Algorithms Library, http://www.cgal.org). 2004 Elsevier B.V. All rights reserved.
منابع مشابه
Experimental Evaluation of Structural Filtering as a Tool for Exact and Efficient Geometric Computing
We report on experimental studies and further investigations of structural filtering introduced in [3] as a paradigm for efficient exact geometric computing. In particular, we show that structural filtering can almost completely avoid the overhead of floating-point filters for many fundamental geometric problems. Furthermore we develop new repair strategies that avoid the very bad performance o...
متن کامل68 Two Computational Geometry Libraries: Leda and Cgal
Over the past decades, two major software libraries that support a wide range of geometric computing have been developed: Leda, the Library of Efficient Data Types and Algorithms, and Cgal, the Computational Geometry Algorithms Library. We start with an introduction of common aspects of both libraries and major differences. We continue with sections that describe each library in detail. Both li...
متن کاملImplementing Basic Displacement Function to Analyze Free Vibration Rotation of Non-Prismatic Euler-Bernoulli Beams
Rotating beams have been considerably appealing to engineers and designers of complex structures i.e. aircraft’s propeller and windmill turbines. In this paper, a new flexibility-based method is proposed for the dynamic analysis of rotating non-prismatic Euler-Bernoulli beams. The flexibility basis of the method ensures the true satisfaction of equilibrium equations at any interior point of the...
متن کاملPoint primitives for interactive modeling and processing of 3D-geometry
3D geometry has become increasingly popular as a new form of digital media. Similar to other types of media data, i.e., sound, images, and video, this requires tools to acquire, store, process, edit, and transmit 3D geometry. With increasing complexity of 3D geometric models and growing demand for advanced modeling functionality, significant effort is being devoted to the design of efficient, r...
متن کاملCombinatorial curve reconstruction and the efficient exact implementation of geometric algorithms
This thesis has two main parts. The first part deals with the problem of curve reconstruction. Given a finite sample set S from an unknown collection of curves Γ, the task is to compute the graph G(S,Γ) which has vertex set S and an edge between exactly those pairs of vertices that are adjacent on some curve in Γ. We present a purely combinatorial algorithm that solves the curve reconstruction ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Comput. Geom.
دوره 31 شماره
صفحات -
تاریخ انتشار 1999